Algebraic Speciication of Dynamic Leader Election Protocols in Broadcast Networks
نویسنده
چکیده
The problem of leader election in distributed systems is considered. Components communicate by means of buuered broadcasting as opposed to usual point-to-point communication. In this paper three leader election protocols of increasing maturity are speciied. We start with a simple leader election protocol, where an initial leader is present. In the second protocol this assumption is dropped. Eventually a fault-tolerant protocol is constructed, where components may crash and revive spontaneously. Both the protocols and the required behaviour are formally speci-ed in ACP. Some remarks are made about a formal veriication of the protocols.
منابع مشابه
A Survey of Reliable Broadcast Protocols for Mobile Ad-hoc Networks
Providing reliable multicast is a basic requirement to build more advanced distributed protocols such as total order or leader election, and much research has gone into providing this functionality for wired networks. However, the protocols developed for wired networks tend to be unsuitable for deployment on mobile ad hoc networks (MANETs), as these do not take into account the node mobility or...
متن کاملNear Optimal Leader Election in Multi-Hop Radio Networks
We present distributed randomized leader election protocols for multi-hop radio networks that elect a leader in almost the same time TBC required for broadcasting a message. For the setting without collision detection, our algorithm runs with high probability in O(D log n D + log n) · min{log logn, log n D } rounds on any n-node network with diameter D. Since TBC = Θ(D log n D + log n) is a low...
متن کاملBroadcast Abstraction in a Stochastic Calculus for Mobile Networks
We introduce a continuous time stochastic broadcast calculus for mobile and wireless networks. The mobility between nodes in a network is modeled by a stochastic mobility function which allows to change part of a network topology depending on an exponentially distributed delay and a network topology constraint. We allow continuous time stochastic behavior of processes running at network nodes, ...
متن کاملEventual Leader Election in Evolving Mobile Networks
Many reliable distributed services rely on an eventual leader election to coordinate actions. The eventual leader detector has been proposed as a way to implement such an abstraction. It ensures that, eventually, each process in the system will be provided by an unique leader, elected among the set of correct processes in spite of crashes and uncertainties. A number of eventual leader election ...
متن کاملAn Improved Leader Election Protocol in Multi-hop Radio Networks
This paper presents two randomized protocols for the problem of electing a \leader" among a set of nodes in an arbitrary multi-hop radio network. First, a variation of the leader election protocol by Bar-Yehuda et al. BGI87] is presented, in which the termination problem is addressed. Then, an eecient randomized leader election protocol in arbitrary multi-hop radio networks is presented. Our el...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996